0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : run_E %s %d THM 0.13/0.34 % Computer : n023.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Thu Jul 4 10:02:24 EDT 2024 0.13/0.34 % CPUTime : 0.21/0.48 Running higher-order theorem proving 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.x5Yx9pGpHW/E---3.1_22371.p 0.66/0.55 # Version: 3.2.0-ho 0.66/0.55 # Preprocessing class: HSSSSMSSSSSNSSA. 0.66/0.55 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.66/0.55 # Starting post_as_ho12 with 180s (1) cores 0.66/0.55 # Starting new_bool_9 with 180s (1) cores 0.66/0.55 # Starting post_as_ho1 with 180s (1) cores 0.66/0.55 # Starting post_as_ho4 with 180s (1) cores 0.66/0.55 # Starting post_as_ho2 with 180s (1) cores 0.66/0.55 # Starting ehoh_best2_full_lfho with 180s (1) cores 0.66/0.55 # Starting full_lambda_10 with 180s (1) cores 0.66/0.55 # Starting new_ho_8 with 180s (1) cores 0.66/0.55 # post_as_ho4 with pid 22452 completed with status 0 0.66/0.55 # Result found by post_as_ho4 0.66/0.55 # Preprocessing class: HSSSSMSSSSSNSSA. 0.66/0.55 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.66/0.55 # Starting post_as_ho12 with 180s (1) cores 0.66/0.55 # Starting new_bool_9 with 180s (1) cores 0.66/0.55 # Starting post_as_ho1 with 180s (1) cores 0.66/0.55 # Starting post_as_ho4 with 180s (1) cores 0.66/0.55 # No SInE strategy applied 0.66/0.55 # Search class: HGHSF-FFSF11-SSSFFSBN 0.66/0.55 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.66/0.55 # Starting ehoh_best2_full_lfho with 98s (1) cores 0.66/0.55 # ehoh_best2_full_lfho with pid 22462 completed with status 0 0.66/0.55 # Result found by ehoh_best2_full_lfho 0.66/0.55 # Preprocessing class: HSSSSMSSSSSNSSA. 0.66/0.55 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 0.66/0.55 # Starting post_as_ho12 with 180s (1) cores 0.66/0.55 # Starting new_bool_9 with 180s (1) cores 0.66/0.55 # Starting post_as_ho1 with 180s (1) cores 0.66/0.55 # Starting post_as_ho4 with 180s (1) cores 0.66/0.55 # No SInE strategy applied 0.66/0.55 # Search class: HGHSF-FFSF11-SSSFFSBN 0.66/0.55 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.66/0.55 # Starting ehoh_best2_full_lfho with 98s (1) cores 0.66/0.55 # Preprocessing time : 0.001 s 0.66/0.55 0.66/0.55 # Proof found! 0.66/0.55 # SZS status Theorem 0.66/0.55 # SZS output start CNFRefutation 0.66/0.55 thf(decl_sort1, type, a: $tType). 0.66/0.55 thf(decl_22, type, epred1_0: a > a > $o). 0.66/0.55 thf(decl_23, type, esk1_0: a). 0.66/0.55 thf(decl_24, type, esk2_0: a). 0.66/0.55 thf(decl_25, type, epred2_0: a > a > $o). 0.66/0.55 thf(decl_26, type, esk3_1: (a > a > $o) > a). 0.66/0.55 thf(decl_27, type, esk4_1: (a > a > $o) > a). 0.66/0.55 thf(decl_28, type, esk5_1: (a > a > $o) > a). 0.66/0.55 thf(cTHM523_pme, conjecture, ![X1:a > a > $o, X2:a, X3:a]:((![X4:a > a > $o]:(((X4 @ X2 @ X3)<=(![X5:a]:((X4 @ X5 @ X5))&![X5:a, X6:a]:(((X4 @ X5 @ X6)<=(X1 @ X5 @ X6))))))<=>(((X2)=(X3))|(X1 @ X2 @ X3)))), file('/export/starexec/sandbox/tmp/tmp.x5Yx9pGpHW/E---3.1_22371.p', cTHM523_pme)). 0.66/0.55 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:a, X3:a]:((![X4:a > a > $o]:(((![X5:a]:((X4 @ X5 @ X5))&![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X4 @ X5 @ X6))))=>(X4 @ X2 @ X3)))<=>(((X2)=(X3))|(X1 @ X2 @ X3))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM523_pme])])). 0.66/0.55 thf(c_0_2, negated_conjecture, ![X18:a, X19:a, X20:a, X21:a > a > $o]:((((((((esk1_0)!=(esk2_0))|(epred2_0 @ X18 @ X18))&(~(epred1_0 @ esk1_0 @ esk2_0)|(epred2_0 @ X18 @ X18)))&((((esk1_0)!=(esk2_0))|(~(epred1_0 @ X19 @ X20)|(epred2_0 @ X19 @ X20)))&(~(epred1_0 @ esk1_0 @ esk2_0)|(~(epred1_0 @ X19 @ X20)|(epred2_0 @ X19 @ X20)))))&((((esk1_0)!=(esk2_0))|~(epred2_0 @ esk1_0 @ esk2_0))&(~(epred1_0 @ esk1_0 @ esk2_0)|~(epred2_0 @ esk1_0 @ esk2_0))))&(((epred1_0 @ (esk4_1 @ X21) @ (esk5_1 @ X21))|~(X21 @ (esk3_1 @ X21) @ (esk3_1 @ X21))|(X21 @ esk1_0 @ esk2_0)|(((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)))&(~(X21 @ (esk4_1 @ X21) @ (esk5_1 @ X21))|~(X21 @ (esk3_1 @ X21) @ (esk3_1 @ X21))|(X21 @ esk1_0 @ esk2_0)|(((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 0.66/0.55 thf(c_0_3, negated_conjecture, ![X1:a > a > $o]:(((epred1_0 @ (esk4_1 @ X1) @ (esk5_1 @ X1))|(X1 @ esk1_0 @ esk2_0)|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|~((X1 @ (esk3_1 @ X1) @ (esk3_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.66/0.55 thf(c_0_4, negated_conjecture, ![X1:a > a > $o]:(((X1 @ esk1_0 @ esk2_0)|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|~((X1 @ (esk4_1 @ X1) @ (esk5_1 @ X1)))|~((X1 @ (esk3_1 @ X1) @ (esk3_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.66/0.55 thf(c_0_5, negated_conjecture, ![X36:a > a > $o, X35:a > a > $o]:((((esk1_0)=(esk2_0))|(epred1_0 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X36 @ Z0 @ Z1)|(X35 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X36 @ Z0 @ Z1)|(X35 @ Z0 @ Z1))))))|((X36 @ esk1_0 @ esk2_0)|(X35 @ esk1_0 @ esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|~(((X36 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X36 @ Z0 @ Z1)|(X35 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X36 @ Z0 @ Z1)|(X35 @ Z0 @ Z1))))))|(X35 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X36 @ Z0 @ Z1)|(X35 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X36 @ Z0 @ Z1)|(X35 @ Z0 @ Z1)))))))))), inference(primitive_enumeration,[status(thm)],[c_0_3])). 0.66/0.55 thf(c_0_6, negated_conjecture, ![X29:a > a > $o, X28:a > a > $o]:((((esk1_0)=(esk2_0))|((X29 @ esk1_0 @ esk2_0)|(X28 @ esk1_0 @ esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|~(((X29 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))))|(X28 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))))))|~(((X29 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))))|(X28 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X29 @ Z0 @ Z1)|(X28 @ Z0 @ Z1)))))))))), inference(primitive_enumeration,[status(thm)],[c_0_4])). 0.66/0.55 thf(c_0_7, negated_conjecture, ![X1:a > a > $o, X4:a > a > $o]:((((esk1_0)=(esk2_0))|(epred1_0 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))))|(epred1_0 @ esk1_0 @ esk2_0)|(X4 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0)|~((X4 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))))))), inference(dynamic_cnf,[status(thm)],[c_0_5])). 0.66/0.55 thf(c_0_8, negated_conjecture, ![X4:a > a > $o, X1:a > a > $o]:((((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0)|(X4 @ esk1_0 @ esk2_0)|~((X1 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1)))))))|~((X1 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])). 0.66/0.55 thf(c_0_9, negated_conjecture, ![X1:a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0))))))=(esk1_0))|((esk1_0)=(esk2_0))|(epred1_0 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0)))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0)))))))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])). 0.66/0.55 thf(c_0_10, negated_conjecture, ![X1:a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0))))))=(esk1_0))|((esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0))))))=(esk1_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_8])). 0.66/0.55 thf(c_0_11, negated_conjecture, ![X4:a > a > $o, X1:a > a > $o]:((((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0)|(X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1)))))))|~((X4 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])). 0.66/0.55 thf(c_0_12, negated_conjecture, ![X1:a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0))))))=(esk1_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|((Z0)!=(esk1_0)))))))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.66/0.55 thf(c_0_13, negated_conjecture, ![X1:a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|(X1 @ Z0 @ Z1)))))=(esk2_0))|((esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|(X1 @ Z0 @ Z1)))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_11])). 0.66/0.55 thf(c_0_14, negated_conjecture, ![X1:a > a > $o, X4:a > a > $o]:((((esk1_0)=(esk2_0))|(epred1_0 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))))|(epred1_0 @ esk1_0 @ esk2_0)|(X4 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0)|~((X1 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X1 @ Z0 @ Z1)|(X4 @ Z0 @ Z1))))))))), inference(dynamic_cnf,[status(thm)],[c_0_5])). 0.66/0.55 thf(c_0_15, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk1_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13])])])). 0.66/0.55 thf(c_0_16, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0)))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0)))))))|(epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15])])])). 0.66/0.55 thf(c_0_17, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|~((((esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))!=(esk2_0))|((esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))!=(esk1_0))))|~(((esk1_0)!=(esk2_0)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_15])])])). 0.66/0.55 thf(c_0_18, negated_conjecture, ![X4:a > a > $o, X1:a > a > $o]:((((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0)|(X4 @ esk1_0 @ esk2_0)|~((X4 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))) @ (esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1)))))))|~((X1 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:(((X4 @ Z0 @ Z1)|(X1 @ Z0 @ Z1))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])). 0.66/0.55 thf(c_0_19, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ (esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0)))))) @ esk2_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_13])])])). 0.66/0.55 thf(c_0_20, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk4_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk1_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_17])])])). 0.66/0.55 thf(c_0_21, negated_conjecture, ![X1:a > a > $o]:((((esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|(X1 @ Z0 @ Z1)))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|(X1 @ esk1_0 @ esk2_0)|~((X1 @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|(X1 @ Z0 @ Z1))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|(X1 @ Z0 @ Z1))))))))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_18])). 0.66/0.55 thf(c_0_22, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.66/0.55 thf(c_0_23, negated_conjecture, (((esk5_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk2_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22])])])). 0.66/0.55 thf(c_0_24, negated_conjecture, (((esk3_1 @ (^[Z0/* 19 */:a, Z1:a]:((((Z1)!=(esk2_0))|((Z0)!=(esk1_0))))))=(esk1_0))|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_23])])])). 0.66/0.55 thf(c_0_25, negated_conjecture, (~((epred1_0 @ esk1_0 @ esk2_0))|~((epred2_0 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.66/0.55 thf(c_0_26, negated_conjecture, (((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_22, c_0_24])). 0.66/0.55 thf(c_0_27, negated_conjecture, (((esk1_0)!=(esk2_0))|~((epred2_0 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.66/0.55 thf(c_0_28, negated_conjecture, ![X2:a, X3:a]:(((epred2_0 @ X2 @ X3)|~((epred1_0 @ esk1_0 @ esk2_0))|~((epred1_0 @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.66/0.55 thf(c_0_29, negated_conjecture, ~((epred2_0 @ esk1_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])). 0.66/0.55 thf(c_0_30, negated_conjecture, ((esk1_0)=(esk2_0)), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_26]), c_0_29]), c_0_26])). 0.66/0.55 thf(c_0_31, negated_conjecture, ![X2:a]:(((epred2_0 @ X2 @ X2)|((esk1_0)!=(esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.66/0.55 thf(c_0_32, negated_conjecture, ~((epred2_0 @ esk2_0 @ esk2_0)), inference(rw,[status(thm)],[c_0_29, c_0_30])). 0.66/0.55 thf(c_0_33, negated_conjecture, ![X2:a]:((epred2_0 @ X2 @ X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_30])])). 0.66/0.55 thf(c_0_34, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_33])]), ['proof']). 0.66/0.55 # SZS output end CNFRefutation 0.66/0.55 # Parsed axioms : 2 0.66/0.55 # Removed by relevancy pruning/SinE : 0 0.66/0.55 # Initial clauses : 9 0.66/0.55 # Removed in clause preprocessing : 1 0.66/0.55 # Initial clauses in saturation : 8 0.66/0.55 # Processed clauses : 191 0.66/0.55 # ...of these trivial : 0 0.66/0.55 # ...subsumed : 46 0.66/0.55 # ...remaining for further processing : 145 0.66/0.55 # Other redundant clauses eliminated : 0 0.66/0.55 # Clauses deleted for lack of memory : 0 0.66/0.55 # Backward-subsumed : 112 0.66/0.55 # Backward-rewritten : 7 0.66/0.55 # Generated clauses : 432 0.66/0.55 # ...of the previous two non-redundant : 323 0.66/0.55 # ...aggressively subsumed : 0 0.66/0.55 # Contextual simplify-reflections : 2 0.66/0.55 # Paramodulations : 151 0.66/0.55 # Factorizations : 1 0.66/0.55 # NegExts : 32 0.66/0.55 # Equation resolutions : 1 0.66/0.55 # Disequality decompositions : 0 0.66/0.55 # Total rewrite steps : 8 0.66/0.55 # ...of those cached : 6 0.66/0.55 # Propositional unsat checks : 0 0.66/0.55 # Propositional check models : 0 0.66/0.55 # Propositional check unsatisfiable : 0 0.66/0.55 # Propositional clauses : 0 0.66/0.55 # Propositional clauses after purity: 0 0.66/0.55 # Propositional unsat core size : 0 0.66/0.55 # Propositional preprocessing time : 0.000 0.66/0.55 # Propositional encoding time : 0.000 0.66/0.55 # Propositional solver time : 0.000 0.66/0.55 # Success case prop preproc time : 0.000 0.66/0.55 # Success case prop encoding time : 0.000 0.66/0.55 # Success case prop solver time : 0.000 0.66/0.55 # Current number of processed clauses : 2 0.66/0.55 # Positive orientable unit clauses : 2 0.66/0.55 # Positive unorientable unit clauses: 0 0.66/0.55 # Negative unit clauses : 0 0.66/0.55 # Non-unit-clauses : 0 0.66/0.55 # Current number of unprocessed clauses: 136 0.66/0.55 # ...number of literals in the above : 805 0.66/0.55 # Current number of archived formulas : 0 0.66/0.55 # Current number of archived clauses : 143 0.66/0.55 # Clause-clause subsumption calls (NU) : 1683 0.66/0.55 # Rec. Clause-clause subsumption calls : 172 0.66/0.55 # Non-unit clause-clause subsumptions : 158 0.66/0.55 # Unit Clause-clause subsumption calls : 2 0.66/0.55 # Rewrite failures with RHS unbound : 0 0.66/0.55 # BW rewrite match attempts : 2 0.66/0.55 # BW rewrite match successes : 2 0.66/0.55 # Condensation attempts : 0 0.66/0.55 # Condensation successes : 0 0.66/0.55 # Termbank termtop insertions : 33735 0.66/0.55 # Search garbage collected termcells : 258 0.66/0.55 0.66/0.55 # ------------------------------------------------- 0.66/0.55 # User time : 0.049 s 0.66/0.55 # System time : 0.003 s 0.66/0.55 # Total time : 0.052 s 0.66/0.55 # Maximum resident set size: 1780 pages 0.66/0.55 0.66/0.55 # ------------------------------------------------- 0.66/0.55 # User time : 0.049 s 0.66/0.55 # System time : 0.007 s 0.66/0.55 # Total time : 0.056 s 0.66/0.55 # Maximum resident set size: 1712 pages 0.66/0.55 % E---3.1 exiting 0.66/0.55 % E exiting 0.66/0.55 EOF